Performance and Complexity Analysis of Rate Constrained Motion Estimation in MPEG-4
نویسندگان
چکیده
Motion estimation constitutes a critical part in video coding since it is computationally expensive and has a substantial impact on the resulting image quality. A very efficient method to estimate motion is through adding a rate constraint for coding of the motion vectors into the estimation process. In this paper we analyze the performance of this approach in the emerging MPEG-4 standard, considering frameas well as object-based video sequences. The investigations show that rate constrained motion estimation generally offers significant gains in coding efficiency which, however, depend on the shape of the object coded. Complexity measurements further show that a rate constraint imposes only a marginal computational overhead, thus making this approach a useful amendment for an MPEG-4 coder.
منابع مشابه
Complexity Control of Fast Motion Estimation in H.264/MPEG-4 AVC with Rate-Distortion-Complexity optimization
A complexity control algorithm for H.264 advanced video coding is proposed. The algorithm can control the complexity of integer inter motion estimation for a given target complexity. The Rate-Distortion-Complexity performance is improved by a complexity prediction model, simple analysis of the past statistics and a control scheme. The algorithm also works well for scene change condition. Test r...
متن کاملComplexity Control of H.264 Based on a Bayesian Framework
A computational complexity control algorithm is proposed for an H.264 encoder running on a processor/power constrained platform. Computational savings are achieved by early prediction of skipped macroblocks prior to motion estimation. The early prediction is based on a Bayesian framework which accurately predicts skipped macroblocks using probability models. Complexity control is achieved by ca...
متن کاملSpatial correlation based fast field motion vector estimation algorithm for interlaced video encoding
A fast motion vector estimation algorithm for Field Motion Estimation having computational complexity independent of search range is presented for interlaced video encoding. The algorithm is based on spatial correlation of motion vectors and yields good tradeoff between motion estimation distortion and number of SAD computations. The speed up achieved by the algorithm is in the order of 190-280...
متن کاملProbability Constrained Search Range Determination for Fast Motion Estimation
© 2012 Hyun-Soo Kang et al. 369 In this paper, we propose new adaptive search range motion estimation methods where the search ranges are constrained by the probabilities of motion vector differences and a search point sampling technique is applied to the constrained search ranges. Our new methods are based on our previous work, in which the search ranges were analytically determined by the pro...
متن کاملComputational Control of an H.264 Encoder through Lagrangian Cost Function Estimation
A complexity control algorithm for an H.264 encoder is proposed. Computational savings are achieved by early prediction of skipped macroblocks prior to motion estimation through estimating a Lagrangian ratedistortion-complexity cost function. A feedback control algorithm ensures that the encoder maintains a predefined target computational complexity. Simulation results demonstrate that the algo...
متن کامل